Nonexistence of some ternary linear codes with minimum weight -2 modulo 9

One of the fundamental problems in coding theory is to find \begin{document}$ n_q(k,d) $\end{document}, minimum length id="M4">\begin{document}$ n $\end{document} for which a linear code id="M5">\begin{document}$ dimension id="M6">\begin{document}$ k and weight id="M7">\begin{document}$ d over field order id="M8">\begin{document}$ q exists. The problem determining values id="M9">\begin{document}$ known as optimal codes problem. Using geometric methods through projective geometry new extension theorem given by Kanda (2020), we determine id="M10">\begin{document}$ n_3(6,d) some id="M11">\begin{document}$ proving nonexistence with certain parameters.